Ranking as Learning Structured Outputs

نویسنده

  • Christopher J.C. Burges
چکیده

We propose a new method for learning structured outputs using gradient descent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured ranking learning using cumulative distribution networks

Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are interested in predicting structured outputs so that misranking one object can significantly affect whether we correctly rank the other objects. In practice, the problem of ranking involves a large number of objects to be ra...

متن کامل

Ranking Network-Structured Decision-Making Units and Its Application in Bank ‎Branches

Data envelopment analysis (DEA) is a method used for measuring the efficiency of decision-making units‎. Unlike the standard models‎, ‎which assume decision-making units to be a black box‎, ‎network data envelopment analysis focuses on the internal structure of these units‎. ‎Some researchers have developed a two-stage method where all the inputs are entirely used in the first stage‎, ‎producin...

متن کامل

Magnitude-Preserving Ranking for Structured Outputs

In this paper, we present a novel method for solving structured prediction problems, based on combining Input Output Kernel Regression (IOKR) with an extension of magnitudepreserving ranking to structured output spaces. In particular, we concentrate on the case where a set of candidate outputs has been given, and the associated pre-image problem calls for ranking the set of candidate outputs. O...

متن کامل

Perturbation based Large Margin Approach for Ranking

The use of the standard hinge loss for structured outputs, for the learning to rank problem, faces two main caveats: (a) the label space, the set of all possible permutations of items to be ranked, is too large, and also less amenable to the usual dynamic-programming based techniques used for structured outputs, and (b) the supervision or training data consists of instances with multiple labels...

متن کامل

Predicting Partial Orders: Ranking with Abstention

The prediction of structured outputs in general and rankings in particular has attracted considerable attention in machine learning in recent years, and different types of ranking problems have already been studied. In this paper, we propose a generalization or, say, relaxation of the standard setting, allowing a model to make predictions in the form of partial instead of total orders. We inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005